منابع مشابه
on the effect of linear & non-linear texts on students comprehension and recalling
چکیده ندارد.
15 صفحه اولLinear Recursion
We define two extensions of the typed linear lambda-calculus that yield minimal Turingcomplete systems. The extensions are based on unbounded recursion in one case, and bounded recursion with minimisation in the other. We show that both approaches are compatible with linearity and typeability constraints. Both extensions of the typed linear lambda-calculus are minimal, in the sense that taking ...
متن کاملLinear Complexity versus Pseudorandomness: On Beth and Dai's Result
Beth and Dai studied in their Eurocrypt paper [1] the relationship between linear complexity (that is, the length of the shortest Linear Feedback Shift Register that generates the given strings) of strings and the Kolmogorov complexity of strings. Though their results are correct, some of their proofs are incorrect. In this note, we demonstrate with a counterexample the reason why their proofs ...
متن کاملPseudorandomness for Linear Length Branching Programs and Stack Machines
We show the existence of an explicit pseudorandom generator G of linear stretch such that for every constant k, the output of G is pseudorandom against: • Oblivious branching programs over alphabet {0, 1} of length kn and size 2 logn) on inputs of size n. • Non-oblivious branching programs over alphabet Σ of length kn, provided the size of Σ is a power of 2 and sufficiently large in terms of k....
متن کاملOn Related-Secret Pseudorandomness
Related-key attacks are attacks against constructions which use a secret key (such as a blockcipher) in which an attacker attempts to exploit known or chosen relationships among keys to circumvent security properties. Security against related-key attacks has been a subject of study in numerous recent cryptographic papers. However, most of these results are attacks on specific constructions, whi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Arithmetica
سال: 2005
ISSN: 0065-1036,1730-6264
DOI: 10.4064/aa118-4-3